#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N=150;
int n;
int tmp[N][N],ans[N][N];
void solve(){
    ans[0][0]=1;
    for(int i=1;i<N;i++){
        for(int j=0;j<N;j++){
            for(int k=0;k*i<N;k++){
                for(int t=0;t+k<N;t++){
                    if(j+k*i>=N){
                        continue;
                    }
                    tmp[j+k*i][k+t]+=ans[j][t];
                }
            }
        }
        memcpy(ans,tmp,sizeof(tmp));
        memset(tmp,0,sizeof(tmp));
    }
}
int main(void){
    solve();
    while(~scanf("%d",&n)){
        int res=0;
        for(int i=0;i<N;i++){
            res+=ans[n][i];
        }
        printf("%d\n",res);
    }
    return 0;
}